SYMMETRIC TENSOR RANK WITH RESPECT TO CURVES

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetric Tensors and Symmetric Tensor Rank

A symmetric tensor is a higher order generalization of a symmetric matrix. In this paper, we study various properties of symmetric tensors in relation to a decomposition into a symmetric sum of outer product of vectors. A rank-1 order-k tensor is the outer product of k non-zero vectors. Any symmetric tensor can be decomposed into a linear combination of rank-1 tensors, each of them being symmet...

متن کامل

Shimura Modular Curves and Asymptotic Symmetric Tensor Rank of Multiplication in any Finite Field

We obtain new asymptotical bounds for the symmetric tensor rank of multiplication in any finite extension of any finite field Fq. In this aim, we use the symmetric Chudnovsky-type generalized algorithm applied on a family of Shimura modular curves defined over Fq2 attaining the Drinfeld-Vlăduţ bound and on the descent of this family over the definition field Fq.

متن کامل

Symmetric curvature tensor

Recently, we have used the symmetric bracket of vector fields, and developed the notion of the symmetric derivation. Using this machinery, we have defined the concept of symmetric curvature. This concept is natural and is related to the notions divergence and Laplacian of vector fields. This concept is also related to the derivations on the algebra of symmetric forms which has been discu...

متن کامل

Conservative Projective Curvature Tensor On Trans-sasakian Manifolds With Respect To Semi-symmetric Metric Connection

We obtain results on the vanishing of divergence of Riemannian and Projective curvature tensors with respect to semi-symmetric metric connection on a trans-Sasakian manifold under the condition φ(gradα) = (n− 2)gradβ.

متن کامل

Symmetric Graphs with Respect to Graph Entropy

Let FG(P ) be a functional defined on the set of all the probability distributions on the vertex set of a graph G. We say that G is symmetric with respect to FG(P ) if the uniform distribution on V (G) maximizes FG(P ). Using the combinatorial definition of the entropy of a graph in terms of its vertex packing polytope and the relationship between the graph entropy and fractional chromatic numb...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Pure and Apllied Mathematics

سال: 2014

ISSN: 1311-8080,1314-3395

DOI: 10.12732/ijpam.v95i4.16